A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems

In this paper, we present a dynamic information-structure mutual exclusion algorithm for distributed systems whose informationstructure evolves with time as sites learn about the state of the system through messages. An interesting feature of the algorithm is that it adapts itself to heterogeneous or fluctuating traffic conditions to optimize the performance (the number of messages exchanged). We study the performance of the algorithm by simulation technique and compare it to the performance a well-known mutual exclusion algorithm [14]. We discuss the impact of message loss and site failures on the algorithm and propose methods to tolerate these failures. ance, mutual exclusion, performance, recovery, starvation.